
/*  A Bison parser, made from dtd2.y with Bison version GNU Bison version 1.22
  */

#define YYBISON 1  /* Identify Bison output.  */

#define	ELESTART	258
#define	ATTSTART	259
#define	ATTFIXED	260
#define	ATTIMPLIED	261
#define	ATTREQUIRED	262
#define	EMPTYLIST	263
#define	WORD	264
#define	QUOTE	265

#line 1 "dtd2.y"

#include <stdio.h>
#include <ctype.h>
#include <malloc.h>
#include "atom.h"
#include "dtd2.h"
#include "dtd.h"

extern int yygetlineno();
void yyerror(char *s);

static void GenerateParents();
static void OrganizeAttrs();
static void CreateDefFile();
static void CreateTabFile();
static void newElement(atom name, int type1, int type2, List *list);
static DTDAttribute *newAttribute(atom name, int type, unsigned int valid,
				  atom dataType, List *list, char *defString,
				  atom defAtom);
static void insertAttr(atom name, List *list);


#line 24 "dtd2.y"
typedef union {
    char *string;
    int opttype;
    int attrtype;
    List *list;
    DTDAttribute *attribute;
} YYSTYPE;

#ifndef YYLTYPE
typedef
  struct yyltype
    {
      int timestamp;
      int first_line;
      int first_column;
      int last_line;
      int last_column;
      char *text;
   }
  yyltype;

#define YYLTYPE yyltype
#endif

#include <stdio.h>

#ifndef __cplusplus
#ifndef __STDC__
#define const
#endif
#endif



#define	YYFINAL		79
#define	YYFLAG		-32768
#define	YYNTBASE	20

#define YYTRANSLATE(x) ((unsigned)(x) <= 265 ? yytranslate[x] : 34)

static const char yytranslate[] = {     0,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,    12,     2,    16,
    17,     2,    15,    13,    18,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,    14,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,    19,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,    11,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     1,     2,     3,     4,     5,
     6,     7,     8,     9,    10
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     2,     5,     7,    10,    13,    20,    28,    35,    37,
    41,    45,    47,    51,    55,    57,    61,    65,    69,    74,
    78,    80,    83,    86,    88,    90,    92,    97,    99,   102,
   106,   110,   114,   118,   122,   127,   131,   135,   139,   143,
   147,   152,   154,   158,   162,   166
};

static const short yyrhs[] = {    21,
     0,    20,    21,     0,    28,     0,    20,    28,     0,    20,
     1,     0,     3,    22,    27,    27,    23,    14,     0,     3,
    22,    27,    27,    23,    15,    14,     0,     3,    22,    27,
    27,     8,    14,     0,     9,     0,    22,    11,    22,     0,
    16,    22,    17,     0,    24,     0,    23,    25,    24,     0,
    23,    26,    24,     0,     9,     0,    24,    11,    24,     0,
    24,    13,    24,     0,    24,    12,    24,     0,    16,    24,
    15,    17,     0,    16,    24,    17,     0,    15,     0,    15,
    15,     0,    15,    18,     0,    18,     0,    18,     0,    19,
     0,     4,    22,    29,    14,     0,    30,     0,    29,    30,
     0,     9,    31,     1,     0,     9,    31,     9,     0,     9,
    31,    10,     0,     9,    31,     7,     0,     9,    31,     6,
     0,     9,    31,     5,    10,     0,     9,    32,     1,     0,
     9,    32,     9,     0,     9,    32,    10,     0,     9,    32,
     7,     0,     9,    32,     6,     0,     9,    32,     5,    10,
     0,     9,     0,    16,     9,    17,     0,    16,    33,    17,
     0,     9,    11,     9,     0,    33,    11,     9,     0
};

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
    43,    46,    49,    52,    56,    61,    69,    77,    87,    92,
    96,   103,   107,   111,   117,   122,   126,   130,   134,   138,
   144,   145,   148,   149,   152,   156,   162,   172,   176,   182,
   187,   193,   199,   205,   211,   217,   222,   228,   235,   241,
   247,   256,   262,   267,   273,   281
};

static const char * const yytname[] = {   "$","error","$illegal.","ELESTART",
"ATTSTART","ATTFIXED","ATTIMPLIED","ATTREQUIRED","EMPTYLIST","WORD","QUOTE",
"'|'","'&'","','","'>'","'+'","'('","')'","'-'","'O'","top","element","slist",
"clist","list","listplus","listminus","eletype","attribute","attlist","att",
"aword","alist","agroup",""
};
#endif

static const short yyr1[] = {     0,
    20,    20,    20,    20,    20,    21,    21,    21,    22,    22,
    22,    23,    23,    23,    24,    24,    24,    24,    24,    24,
    25,    25,    26,    26,    27,    27,    28,    29,    29,    30,
    30,    30,    30,    30,    30,    30,    30,    30,    30,    30,
    30,    31,    32,    32,    33,    33
};

static const short yyr2[] = {     0,
     1,     2,     1,     2,     2,     6,     7,     6,     1,     3,
     3,     1,     3,     3,     1,     3,     3,     3,     4,     3,
     1,     2,     2,     1,     1,     1,     4,     1,     2,     3,
     3,     3,     3,     3,     4,     3,     3,     3,     3,     3,
     4,     1,     3,     3,     3,     3
};

static const short yydefact[] = {     0,
     0,     0,     0,     1,     3,     9,     0,     0,     0,     5,
     2,     4,     0,     0,    25,    26,     0,     0,     0,    28,
    11,    10,     0,    42,     0,     0,     0,    27,    29,     0,
    15,     0,     0,    12,     0,     0,    30,     0,    34,    33,
    31,    32,    36,     0,    40,    39,    37,    38,     8,     0,
     6,    21,    24,     0,     0,     0,     0,     0,     0,    43,
     0,    44,    35,    41,     0,    20,     7,    22,    23,    13,
    14,    16,    18,    17,    45,    46,    19,     0,     0
};

static const short yydefgoto[] = {     3,
     4,     8,    33,    34,    54,    55,    17,     5,    19,    20,
    26,    27,    36
};

static const short yypact[] = {    31,
    11,    11,    57,-32768,-32768,-32768,    11,    10,    -7,-32768,
-32768,-32768,    33,    11,-32768,-32768,    18,    23,    42,-32768,
-32768,-32768,    22,-32768,    -4,     2,     9,-32768,-32768,     3,
-32768,    24,    48,    58,    35,    37,-32768,    39,-32768,-32768,
-32768,-32768,-32768,    43,-32768,-32768,-32768,-32768,-32768,    30,
-32768,    50,-32768,    24,    24,    24,    24,    24,    46,-32768,
    63,-32768,-32768,-32768,    56,-32768,-32768,-32768,-32768,    58,
    58,-32768,-32768,-32768,-32768,-32768,-32768,    59,-32768
};

static const short yypgoto[] = {-32768,
    64,    -1,-32768,   -32,-32768,-32768,    60,    71,-32768,    61,
-32768,-32768,-32768
};


#define	YYLAST		80


static const short yytable[] = {    50,
     9,    18,    37,    14,    35,    13,    38,    39,    40,    43,
    41,    42,    22,    44,    45,    46,    49,    47,    48,     6,
    14,    70,    71,    72,    73,    74,     7,    15,    16,    30,
    31,    24,    31,     1,     2,    15,    16,    32,    25,    32,
    56,    57,    58,    14,    65,    59,    66,    61,    63,    21,
    18,    60,    64,    62,    75,    28,    78,    10,    79,     1,
     2,    51,    52,    67,    68,    53,    11,    69,    56,    57,
    58,    76,    77,    12,     0,     0,    23,     0,     0,    29
};

static const short yycheck[] = {    32,
     2,     9,     1,    11,     9,     7,     5,     6,     7,     1,
     9,    10,    14,     5,     6,     7,    14,     9,    10,     9,
    11,    54,    55,    56,    57,    58,    16,    18,    19,     8,
     9,     9,     9,     3,     4,    18,    19,    16,    16,    16,
    11,    12,    13,    11,    15,    11,    17,    11,    10,    17,
     9,    17,    10,    17,     9,    14,     0,     1,     0,     3,
     4,    14,    15,    14,    15,    18,     3,    18,    11,    12,
    13,     9,    17,     3,    -1,    -1,    17,    -1,    -1,    19
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/lib/bison.simple"

/* Skeleton output parser for bison,
   Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman

   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 1, or (at your option)
   any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.  */


#ifndef alloca
#ifdef __GNUC__
#define alloca __builtin_alloca
#else /* not GNU C.  */
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi)
#include <alloca.h>
#else /* not sparc */
#if defined (MSDOS) && !defined (__TURBOC__)
#include <malloc.h>
#else /* not MSDOS, or __TURBOC__ */
#if defined(_AIX)
#include <malloc.h>
 #pragma alloca
#else /* not MSDOS, __TURBOC__, or _AIX */
#ifdef __hpux
#ifdef __cplusplus
extern "C" {
void *alloca (unsigned int);
};
#else /* not __cplusplus */
void *alloca ();
#endif /* not __cplusplus */
#endif /* __hpux */
#endif /* not _AIX */
#endif /* not MSDOS, or __TURBOC__ */
#endif /* not sparc.  */
#endif /* not GNU C.  */
#endif /* alloca not defined.  */

/* This is the parser code that is written into each bison parser
  when the %semantic_parser declaration is not specified in the grammar.
  It was written by Richard Stallman by simplifying the hairy parser
  used when %semantic_parser is specified.  */

/* Note: there must be only one dollar sign in this file.
   It is replaced by the list of actions, each action
   as one case of the switch.  */

#define yyerrok		(yyerrstatus = 0)
#define yyclearin	(yychar = YYEMPTY)
#define YYEMPTY		-2
#define YYEOF		0
#define YYACCEPT	return(0)
#define YYABORT 	return(1)
#define YYERROR		goto yyerrlab1
/* Like YYERROR except do call yyerror.
   This remains here temporarily to ease the
   transition to the new meaning of YYERROR, for GCC.
   Once GCC version 2 has supplanted version 1, this can go.  */
#define YYFAIL		goto yyerrlab
#define YYRECOVERING()  (!!yyerrstatus)
#define YYBACKUP(token, value) \
do								\
  if (yychar == YYEMPTY && yylen == 1)				\
    { yychar = (token), yylval = (value);			\
      yychar1 = YYTRANSLATE (yychar);				\
      YYPOPSTACK;						\
      goto yybackup;						\
    }								\
  else								\
    { yyerror ("syntax error: cannot back up"); YYERROR; }	\
while (0)

#define YYTERROR	1
#define YYERRCODE	256

#ifndef YYPURE
#define YYLEX		yylex()
#endif

#ifdef YYPURE
#ifdef YYLSP_NEEDED
#define YYLEX		yylex(&yylval, &yylloc)
#else
#define YYLEX		yylex(&yylval)
#endif
#endif

/* If nonreentrant, generate the variables here */

#ifndef YYPURE

int	yychar;			/*  the lookahead symbol		*/
YYSTYPE	yylval;			/*  the semantic value of the		*/
				/*  lookahead symbol			*/

#ifdef YYLSP_NEEDED
YYLTYPE yylloc;			/*  location data for the lookahead	*/
				/*  symbol				*/
#endif

int yynerrs;			/*  number of parse errors so far       */
#endif  /* not YYPURE */

#if YYDEBUG != 0
int yydebug;			/*  nonzero means print parse trace	*/
/* Since this is uninitialized, it does not stop multiple parsers
   from coexisting.  */
#endif

/*  YYINITDEPTH indicates the initial size of the parser's stacks	*/

#ifndef	YYINITDEPTH
#define YYINITDEPTH 200
#endif

/*  YYMAXDEPTH is the maximum size the stacks can grow to
    (effective only if the built-in stack extension method is used).  */

#if YYMAXDEPTH == 0
#undef YYMAXDEPTH
#endif

#ifndef YYMAXDEPTH
#define YYMAXDEPTH 10000
#endif

/* Prevent warning if -Wstrict-prototypes.  */
#ifdef __GNUC__
int yyparse (void);
#endif

#if __GNUC__ > 1		/* GNU C and GNU C++ define this.  */
#define __yy_bcopy(FROM,TO,COUNT)	__builtin_memcpy(TO,FROM,COUNT)
#else				/* not GNU C or C++ */
#ifndef __cplusplus

/* This is the most reliable way to avoid incompatibilities
   in available built-in functions on various systems.  */
static void
__yy_bcopy (from, to, count)
     char *from;
     char *to;
     int count;
{
  register char *f = from;
  register char *t = to;
  register int i = count;

  while (i-- > 0)
    *t++ = *f++;
}

#else /* __cplusplus */

/* This is the most reliable way to avoid incompatibilities
   in available built-in functions on various systems.  */
static void
__yy_bcopy (char *from, char *to, int count)
{
  register char *f = from;
  register char *t = to;
  register int i = count;

  while (i-- > 0)
    *t++ = *f++;
}

#endif
#endif

#line 184 "/usr/lib/bison.simple"
int
yyparse()
{
  register int yystate;
  register int yyn;
  register short *yyssp;
  register YYSTYPE *yyvsp;
  int yyerrstatus;	/*  number of tokens to shift before error messages enabled */
  int yychar1 = 0;		/*  lookahead token as an internal (translated) token number */

  short	yyssa[YYINITDEPTH];	/*  the state stack			*/
  YYSTYPE yyvsa[YYINITDEPTH];	/*  the semantic value stack		*/

  short *yyss = yyssa;		/*  refer to the stacks thru separate pointers */
  YYSTYPE *yyvs = yyvsa;	/*  to allow yyoverflow to reallocate them elsewhere */

#ifdef YYLSP_NEEDED
  YYLTYPE yylsa[YYINITDEPTH];	/*  the location stack			*/
  YYLTYPE *yyls = yylsa;
  YYLTYPE *yylsp;

#define YYPOPSTACK   (yyvsp--, yyssp--, yylsp--)
#else
#define YYPOPSTACK   (yyvsp--, yyssp--)
#endif

  int yystacksize = YYINITDEPTH;

#ifdef YYPURE
  int yychar;
  YYSTYPE yylval;
  int yynerrs;
#ifdef YYLSP_NEEDED
  YYLTYPE yylloc;
#endif
#endif

  YYSTYPE yyval;		/*  the variable used to return		*/
				/*  semantic values from the action	*/
				/*  routines				*/

  int yylen;

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Starting parse\n");
#endif

  yystate = 0;
  yyerrstatus = 0;
  yynerrs = 0;
  yychar = YYEMPTY;		/* Cause a token to be read.  */

  /* Initialize stack pointers.
     Waste one element of value and location stack
     so that they stay on the same level as the state stack.
     The wasted elements are never initialized.  */

  yyssp = yyss - 1;
  yyvsp = yyvs;
#ifdef YYLSP_NEEDED
  yylsp = yyls;
#endif

/* Push a new state, which is found in  yystate  .  */
/* In all cases, when you get here, the value and location stacks
   have just been pushed. so pushing a state here evens the stacks.  */
yynewstate:

  *++yyssp = yystate;

  if (yyssp >= yyss + yystacksize - 1)
    {
      /* Give user a chance to reallocate the stack */
      /* Use copies of these so that the &'s don't force the real ones into memory. */
      YYSTYPE *yyvs1 = yyvs;
      short *yyss1 = yyss;
#ifdef YYLSP_NEEDED
      YYLTYPE *yyls1 = yyls;
#endif

      /* Get the current used size of the three stacks, in elements.  */
      int size = yyssp - yyss + 1;

#ifdef yyoverflow
      /* Each stack pointer address is followed by the size of
	 the data in use in that stack, in bytes.  */
#ifdef YYLSP_NEEDED
      /* This used to be a conditional around just the two extra args,
	 but that might be undefined if yyoverflow is a macro.  */
      yyoverflow("parser stack overflow",
		 &yyss1, size * sizeof (*yyssp),
		 &yyvs1, size * sizeof (*yyvsp),
		 &yyls1, size * sizeof (*yylsp),
		 &yystacksize);
#else
      yyoverflow("parser stack overflow",
		 &yyss1, size * sizeof (*yyssp),
		 &yyvs1, size * sizeof (*yyvsp),
		 &yystacksize);
#endif

      yyss = yyss1; yyvs = yyvs1;
#ifdef YYLSP_NEEDED
      yyls = yyls1;
#endif
#else /* no yyoverflow */
      /* Extend the stack our own way.  */
      if (yystacksize >= YYMAXDEPTH)
	{
	  yyerror("parser stack overflow");
	  return 2;
	}
      yystacksize *= 2;
      if (yystacksize > YYMAXDEPTH)
	yystacksize = YYMAXDEPTH;
      yyss = (short *) alloca (yystacksize * sizeof (*yyssp));
      __yy_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
      yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
      __yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
      yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
      __yy_bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp));
#endif
#endif /* no yyoverflow */

      yyssp = yyss + size - 1;
      yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
      yylsp = yyls + size - 1;
#endif

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Stack size increased to %d\n", yystacksize);
#endif

      if (yyssp >= yyss + yystacksize - 1)
	YYABORT;
    }

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Entering state %d\n", yystate);
#endif

  goto yybackup;
 yybackup:

/* Do appropriate processing given the current state.  */
/* Read a lookahead token if we need one and don't already have one.  */
/* yyresume: */

  /* First try to decide what to do without reference to lookahead token.  */

  yyn = yypact[yystate];
  if (yyn == YYFLAG)
    goto yydefault;

  /* Not known => get a lookahead token if don't already have one.  */

  /* yychar is either YYEMPTY or YYEOF
     or a valid token in external form.  */

  if (yychar == YYEMPTY)
    {
#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Reading a token: ");
#endif
      yychar = YYLEX;
    }

  /* Convert token to internal form (in yychar1) for indexing tables with */

  if (yychar <= 0)		/* This means end of input. */
    {
      yychar1 = 0;
      yychar = YYEOF;		/* Don't call YYLEX any more */

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Now at end of input.\n");
#endif
    }
  else
    {
      yychar1 = YYTRANSLATE(yychar);

#if YYDEBUG != 0
      if (yydebug)
	{
	  fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
	  /* Give the individual parser a way to print the precise meaning
	     of a token, for further debugging info.  */
#ifdef YYPRINT
	  YYPRINT (stderr, yychar, yylval);
#endif
	  fprintf (stderr, ")\n");
	}
#endif
    }

  yyn += yychar1;
  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
    goto yydefault;

  yyn = yytable[yyn];

  /* yyn is what to do for this token type in this state.
     Negative => reduce, -yyn is rule number.
     Positive => shift, yyn is new state.
       New state is final state => don't bother to shift,
       just return success.
     0, or most negative number => error.  */

  if (yyn < 0)
    {
      if (yyn == YYFLAG)
	goto yyerrlab;
      yyn = -yyn;
      goto yyreduce;
    }
  else if (yyn == 0)
    goto yyerrlab;

  if (yyn == YYFINAL)
    YYACCEPT;

  /* Shift the lookahead token.  */

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
#endif

  /* Discard the token being shifted unless it is eof.  */
  if (yychar != YYEOF)
    yychar = YYEMPTY;

  *++yyvsp = yylval;
#ifdef YYLSP_NEEDED
  *++yylsp = yylloc;
#endif

  /* count tokens shifted since error; after three, turn off error status.  */
  if (yyerrstatus) yyerrstatus--;

  yystate = yyn;
  goto yynewstate;

/* Do the default action for the current state.  */
yydefault:

  yyn = yydefact[yystate];
  if (yyn == 0)
    goto yyerrlab;

/* Do a reduction.  yyn is the number of a rule to reduce with.  */
yyreduce:
  yylen = yyr2[yyn];
  if (yylen > 0)
    yyval = yyvsp[1-yylen]; /* implement default value of the action */

#if YYDEBUG != 0
  if (yydebug)
    {
      int i;

      fprintf (stderr, "Reducing via rule %d (line %d), ",
	       yyn, yyrline[yyn]);

      /* Print the symbols being reduced, and their result.  */
      for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
	fprintf (stderr, "%s ", yytname[yyrhs[i]]);
      fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
    }
#endif


  switch (yyn) {

case 1:
#line 44 "dtd2.y"
{
		    ;
    break;}
case 2:
#line 47 "dtd2.y"
{
		    ;
    break;}
case 3:
#line 50 "dtd2.y"
{
		    ;
    break;}
case 4:
#line 53 "dtd2.y"
{
		    ;
    break;}
case 5:
#line 57 "dtd2.y"
{
		    ;
    break;}
case 6:
#line 62 "dtd2.y"
{
			atom at;

			while ((at = PopList(yyvsp[-4].list)) != 0) {
			    newElement(at, yyvsp[-3].opttype, yyvsp[-2].opttype, yyvsp[-1].list);
			}
		    ;
    break;}
case 7:
#line 70 "dtd2.y"
{
			atom at;

			while ((at = PopList(yyvsp[-5].list)) != 0) {
			    newElement(at, yyvsp[-4].opttype, yyvsp[-3].opttype, yyvsp[-2].list);
			}
		    ;
    break;}
case 8:
#line 78 "dtd2.y"
{
			atom at;

			while ((at = PopList(yyvsp[-4].list)) != 0) {
			    newElement(at, yyvsp[-3].opttype, yyvsp[-2].opttype, 0);
			}
		    ;
    break;}
case 9:
#line 88 "dtd2.y"
{
			atom at = GetAtom(yyvsp[0].string);
			yyval.list = AddList(0, at);
		    ;
    break;}
case 10:
#line 93 "dtd2.y"
{
			yyval.list = sumLists(yyvsp[-2].list, yyvsp[0].list);
		    ;
    break;}
case 11:
#line 97 "dtd2.y"
{
			yyval.list = yyvsp[-1].list;
		    ;
    break;}
case 12:
#line 104 "dtd2.y"
{
			yyval.list = yyvsp[0].list;
		    ;
    break;}
case 13:
#line 108 "dtd2.y"
{
			yyval.list = sumLists(yyvsp[-2].list, yyvsp[0].list);
		    ;
    break;}
case 14:
#line 112 "dtd2.y"
{
			yyval.list = subLists(yyvsp[-2].list, yyvsp[0].list);
		    ;
    break;}
case 15:
#line 118 "dtd2.y"
{
			atom at = GetAtom(yyvsp[0].string);
			yyval.list = AddList(0, at);
		    ;
    break;}
case 16:
#line 123 "dtd2.y"
{
			yyval.list = sumLists(yyvsp[-2].list, yyvsp[0].list);
		    ;
    break;}
case 17:
#line 127 "dtd2.y"
{
			yyval.list = sumLists(yyvsp[-2].list, yyvsp[0].list);
		    ;
    break;}
case 18:
#line 131 "dtd2.y"
{
			yyval.list = sumLists(yyvsp[-2].list, yyvsp[0].list);
		    ;
    break;}
case 19:
#line 135 "dtd2.y"
{
			yyval.list = yyvsp[-2].list;
		    ;
    break;}
case 20:
#line 139 "dtd2.y"
{
			yyval.list = yyvsp[-1].list;
		    ;
    break;}
case 25:
#line 153 "dtd2.y"
{
			yyval.opttype = 0;
		    ;
    break;}
case 26:
#line 157 "dtd2.y"
{
			yyval.opttype = 1;
		    ;
    break;}
case 27:
#line 163 "dtd2.y"
{
			atom at;

			while ((at = PopList(yyvsp[-2].list)) != 0) {
			    insertAttr(at, yyvsp[-1].list);
			}
		    ;
    break;}
case 28:
#line 173 "dtd2.y"
{
			yyval.list = AddList(0, (int)yyvsp[0].attribute);
		    ;
    break;}
case 29:
#line 177 "dtd2.y"
{
			yyval.list = AddList(yyvsp[-1].list, (int)yyvsp[0].attribute);
		    ;
    break;}
case 30:
#line 183 "dtd2.y"
{
			fprintf(stderr, "%d: Unknown attribute type\n",
				yygetlineno());
		    ;
    break;}
case 31:
#line 188 "dtd2.y"
{
			yyval.attribute = newAttribute(GetAtom(yyvsp[-2].string), A_IMPLIED,
					  AF_DATATYPE | AF_DEFATOM,
					  GetAtom(yyvsp[-1].string), 0, 0, GetAtom(yyvsp[0].string));
		    ;
    break;}
case 32:
#line 194 "dtd2.y"
{
			yyval.attribute = newAttribute(GetAtom(yyvsp[-2].string), A_IMPLIED,
					  AF_DATATYPE | AF_DEFSTRING,
					  GetAtom(yyvsp[-1].string), 0, yyvsp[0].string, 0);
		    ;
    break;}
case 33:
#line 200 "dtd2.y"
{
			yyval.attribute = newAttribute(GetAtom(yyvsp[-2].string), A_REQUIRED,
					  AF_DATATYPE,
					  GetAtom(yyvsp[-1].string), 0, 0, 0);
		    ;
    break;}
case 34:
#line 206 "dtd2.y"
{
			yyval.attribute = newAttribute(GetAtom(yyvsp[-2].string), A_IMPLIED,
					  AF_DATATYPE,
					  GetAtom(yyvsp[-1].string), 0, 0, 0);
		    ;
    break;}
case 35:
#line 212 "dtd2.y"
{
			yyval.attribute = newAttribute(GetAtom(yyvsp[-3].string), A_FIXED,
					  AF_DATATYPE | AF_DEFSTRING,
					  GetAtom(yyvsp[-2].string), 0, yyvsp[0].string, 0);
		    ;
    break;}
case 36:
#line 218 "dtd2.y"
{
			fprintf(stderr, "%d: Unknown attribute type\n",
				yygetlineno());
		    ;
    break;}
case 37:
#line 223 "dtd2.y"
{
			yyval.attribute = newAttribute(GetAtom(yyvsp[-2].string), A_IMPLIED,
					  AF_LIST | AF_DEFATOM,
					  0, yyvsp[-1].list, 0, GetAtom(yyvsp[0].string));
		    ;
    break;}
case 38:
#line 229 "dtd2.y"
{
			/* Unlikely to ever show up */
			yyval.attribute = newAttribute(GetAtom(yyvsp[-2].string), A_IMPLIED,
					  AF_LIST | AF_DEFSTRING,
					  0, yyvsp[-1].list, yyvsp[0].string, 0);
		    ;
    break;}
case 39:
#line 236 "dtd2.y"
{
			yyval.attribute = newAttribute(GetAtom(yyvsp[-2].string), A_REQUIRED,
					  AF_LIST,
					  0, yyvsp[-1].list, 0, 0);
		    ;
    break;}
case 40:
#line 242 "dtd2.y"
{
			yyval.attribute = newAttribute(GetAtom(yyvsp[-2].string), A_IMPLIED,
					  AF_LIST,
					  0, yyvsp[-1].list, 0, 0);
		    ;
    break;}
case 41:
#line 248 "dtd2.y"
{
			/* Unlikely to ever show up */
			yyval.attribute = newAttribute(GetAtom(yyvsp[-3].string), A_FIXED,
					  AF_LIST | AF_DEFSTRING,
					  0, yyvsp[-2].list, yyvsp[0].string, 0);
		    ;
    break;}
case 42:
#line 257 "dtd2.y"
{
			yyval.string = yyvsp[0].string;
		    ;
    break;}
case 43:
#line 263 "dtd2.y"
{
			atom at = GetAtom(yyvsp[-1].string);
			yyval.list = AddList(0, at);
		    ;
    break;}
case 44:
#line 268 "dtd2.y"
{
			yyval.list = yyvsp[-1].list;
		    ;
    break;}
case 45:
#line 274 "dtd2.y"
{
			atom at = GetAtom(yyvsp[-2].string);
			atom at2 = GetAtom(yyvsp[0].string);

			yyval.list = AddList(0, at);
			yyval.list = AddList(yyval.list, at2);
		    ;
    break;}
case 46:
#line 282 "dtd2.y"
{
			atom at2 = GetAtom(yyvsp[0].string);

			yyval.list = AddList(yyvsp[-2].list, at2);
		    ;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 465 "/usr/lib/bison.simple"

  yyvsp -= yylen;
  yyssp -= yylen;
#ifdef YYLSP_NEEDED
  yylsp -= yylen;
#endif

#if YYDEBUG != 0
  if (yydebug)
    {
      short *ssp1 = yyss - 1;
      fprintf (stderr, "state stack now");
      while (ssp1 != yyssp)
	fprintf (stderr, " %d", *++ssp1);
      fprintf (stderr, "\n");
    }
#endif

  *++yyvsp = yyval;

#ifdef YYLSP_NEEDED
  yylsp++;
  if (yylen == 0)
    {
      yylsp->first_line = yylloc.first_line;
      yylsp->first_column = yylloc.first_column;
      yylsp->last_line = (yylsp-1)->last_line;
      yylsp->last_column = (yylsp-1)->last_column;
      yylsp->text = 0;
    }
  else
    {
      yylsp->last_line = (yylsp+yylen-1)->last_line;
      yylsp->last_column = (yylsp+yylen-1)->last_column;
    }
#endif

  /* Now "shift" the result of the reduction.
     Determine what state that goes to,
     based on the state we popped back to
     and the rule number reduced by.  */

  yyn = yyr1[yyn];

  yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
  if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
    yystate = yytable[yystate];
  else
    yystate = yydefgoto[yyn - YYNTBASE];

  goto yynewstate;

yyerrlab:   /* here on detecting error */

  if (! yyerrstatus)
    /* If not already recovering from an error, report this error.  */
    {
      ++yynerrs;

#ifdef YYERROR_VERBOSE
      yyn = yypact[yystate];

      if (yyn > YYFLAG && yyn < YYLAST)
	{
	  int size = 0;
	  char *msg;
	  int x, count;

	  count = 0;
	  /* Start X at -yyn if nec to avoid negative indexes in yycheck.  */
	  for (x = (yyn < 0 ? -yyn : 0);
	       x < (sizeof(yytname) / sizeof(char *)); x++)
	    if (yycheck[x + yyn] == x)
	      size += strlen(yytname[x]) + 15, count++;
	  msg = (char *) malloc(size + 15);
	  if (msg != 0)
	    {
	      strcpy(msg, "parse error");

	      if (count < 5)
		{
		  count = 0;
		  for (x = (yyn < 0 ? -yyn : 0);
		       x < (sizeof(yytname) / sizeof(char *)); x++)
		    if (yycheck[x + yyn] == x)
		      {
			strcat(msg, count == 0 ? ", expecting `" : " or `");
			strcat(msg, yytname[x]);
			strcat(msg, "'");
			count++;
		      }
		}
	      yyerror(msg);
	      free(msg);
	    }
	  else
	    yyerror ("parse error; also virtual memory exceeded");
	}
      else
#endif /* YYERROR_VERBOSE */
	yyerror("parse error");
    }

  goto yyerrlab1;
yyerrlab1:   /* here on error raised explicitly by an action */

  if (yyerrstatus == 3)
    {
      /* if just tried and failed to reuse lookahead token after an error, discard it.  */

      /* return failure if at end of input */
      if (yychar == YYEOF)
	YYABORT;

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif

      yychar = YYEMPTY;
    }

  /* Else will try to reuse lookahead token
     after shifting the error token.  */

  yyerrstatus = 3;		/* Each real token shifted decrements this */

  goto yyerrhandle;

yyerrdefault:  /* current state does not do anything special for the error token. */

#if 0
  /* This is wrong; only states that explicitly want error tokens
     should shift them.  */
  yyn = yydefact[yystate];  /* If its default is to accept any token, ok.  Otherwise pop it.*/
  if (yyn) goto yydefault;
#endif

yyerrpop:   /* pop the current state because it cannot handle the error token */

  if (yyssp == yyss) YYABORT;
  yyvsp--;
  yystate = *--yyssp;
#ifdef YYLSP_NEEDED
  yylsp--;
#endif

#if YYDEBUG != 0
  if (yydebug)
    {
      short *ssp1 = yyss - 1;
      fprintf (stderr, "Error: state stack now");
      while (ssp1 != yyssp)
	fprintf (stderr, " %d", *++ssp1);
      fprintf (stderr, "\n");
    }
#endif

yyerrhandle:

  yyn = yypact[yystate];
  if (yyn == YYFLAG)
    goto yyerrdefault;

  yyn += YYTERROR;
  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
    goto yyerrdefault;

  yyn = yytable[yyn];
  if (yyn < 0)
    {
      if (yyn == YYFLAG)
	goto yyerrpop;
      yyn = -yyn;
      goto yyreduce;
    }
  else if (yyn == 0)
    goto yyerrpop;

  if (yyn == YYFINAL)
    YYACCEPT;

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Shifting error token, ");
#endif

  *++yyvsp = yylval;
#ifdef YYLSP_NEEDED
  *++yylsp = yylloc;
#endif

  yystate = yyn;
  goto yynewstate;
}
#line 288 "dtd2.y"


extern FILE *yyin;

main()
{
    while (!feof(yyin)) {
	yyparse();
    }
    GenerateParents();
    OrganizeAttrs();
    CreateDefFile();
    CreateTabFile();
    exit(0);
}

void
yyerror(char *s)
{
    fprintf(stderr, "%d: %s\n", yygetlineno(), s);
}

static DTDElement *eTable[5000];

static void
CreateDefFile()
{
    int i;
    FILE *fp, *fopen();

    fp = fopen("dtddefs.h", "w");
    if (fp == NULL) {
	perror("dtddefs.h");
	return;
    }

    fprintf(fp, "/*\n * This file automatically generated\n */\n\n");
    for (i = 1; GetAtomVal(i); i++) {
	fprintf(fp, "#define %-10.10s  %d\n", GetAtomVal(i), i);
    }
    fprintf(fp, "#define MAXELEMENT\t%d\n", i);
}

static void
CreateTabFile()
{
    int i, j, k;
    FILE *fp, *fopen();

    fp = fopen("dtdtab.h", "w");
    if (fp == NULL) {
	perror("dtdtab.h");
	return;
    }

    fprintf(fp, "/*\n * This file automatically generated\n */\n\n");
    fprintf(fp, "#include \"dtd2.h\"\n\n");

    /* Create an array of atom names */

    fprintf(fp, "static char *atoms[] = {\n\t0,\n");
    for (i = 1; GetAtomVal(i); i++) {
	fprintf(fp, "\t\"%s\",\n", GetAtomVal(i));
    }
    fprintf(fp, "};\n");

    /* Create an array of elements */
    fprintf(fp, "\nDTDElement eTable[] = {\n");
    for (i = 1; GetAtomVal(i); i++) {
	if (eTable[i]) {
	    fprintf(fp, "    { %s, 0x%x,\n      { ",
		    GetAtomVal(i),
		    eTable[i]->flags);
	    /* children */
	    for (j = 0; j < 10; j++) {
		atom at = eTable[i]->children[j];

		if (at)
		    fprintf(fp, " %s,", GetAtomVal(at));
		else
		    fprintf(fp, " 0,", GetAtomVal(at));
	    }
	    fprintf(fp, "\n        ");
	    for ( ; j < 20; j++) {
		atom at = eTable[i]->children[j];

		if (at)
		    fprintf(fp, " %s,", GetAtomVal(at));
		else
		    fprintf(fp, " 0,", GetAtomVal(at));
	    }
	    fprintf(fp, "\n        ");
	    for ( ; j < 30; j++) {
		atom at = eTable[i]->children[j];

		if (at)
		    fprintf(fp, " %s,", GetAtomVal(at));
		else
		    fprintf(fp, " 0,", GetAtomVal(at));
	    }
	    fprintf(fp, "\n        ");
	    for ( ; j < 40; j++) {
		atom at = eTable[i]->children[j];

		if (at)
		    fprintf(fp, " %s,", GetAtomVal(at));
		else
		    fprintf(fp, " 0,", GetAtomVal(at));
	    }
	    fprintf(fp, "\n      },\n      { ");
	    /* parents */
	    for (j = 0; j < 10; j++) {
		atom at = eTable[i]->parents[j];

		if (at)
		    fprintf(fp, " %s,", GetAtomVal(at));
		else
		    fprintf(fp, " 0,", GetAtomVal(at));
	    }
	    fprintf(fp, "\n        ");
	    for ( ; j < 20; j++) {
		atom at = eTable[i]->parents[j];

		if (at)
		    fprintf(fp, " %s,", GetAtomVal(at));
		else
		    fprintf(fp, " 0,", GetAtomVal(at));
	    }
	    fprintf(fp, "\n        ");
	    for ( ; j < 30; j++) {
		atom at = eTable[i]->parents[j];

		if (at)
		    fprintf(fp, " %s,", GetAtomVal(at));
		else
		    fprintf(fp, " 0,", GetAtomVal(at));
	    }
	    fprintf(fp, "\n        ");
	    for ( ; j < 40; j++) {
		atom at = eTable[i]->parents[j];

		if (at)
		    fprintf(fp, " %s,", GetAtomVal(at));
		else
		    fprintf(fp, " 0,", GetAtomVal(at));
	    }
	    fprintf(fp, "\n      },\n      {\n");
	    for (j = 0; j < 10; j++) {
		DTDAttribute *ap = &(eTable[i]->attrs[j]);
		fprintf(fp, "        { ");
		if (ap->name != 0) {
		    char *str;
		    int k;

		    switch (ap->type) {
			case A_REQUIRED:
			    str = "A_REQUIRED";
			    break;
			case A_FIXED:
			    str = "A_FIXED";
			    break;
			case A_IMPLIED:
			    str = "A_IMPLIED";
			    break;
		    }

		    fprintf(fp, "  %s, %s, 0x%x, ",
			    GetAtomVal(ap->name), str, ap->valid);

		    if (ap->dataType)
			fprintf(fp, "%s,\n            {",
				GetAtomVal(ap->dataType));
		    else
			fprintf(fp, "0,\n            {");

		    for (k = 0; k < 10; k++) {
			if (ap->list[k])
			    fprintf(fp, " %s,",
				    GetAtomVal(ap->list[k]));
			else
			    fprintf(fp, " 0,");
		    }
		    fprintf(fp, " },\n");
		    if (ap->defString)
			fprintf(fp, "            \"%s\",\n", ap->defString);
		    else
			fprintf(fp, "            0,\n");
		    if (ap->defAtom)
			fprintf(fp, "            %s\n",
				GetAtomVal(ap->defAtom));
		    else
			fprintf(fp, "            0\n");
		}
		else {
		    fprintf(fp, "  0, 0, 0, 0,\n"
				"            { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },"
				"\n            0,\n"
				"            0\n");
		}
		fprintf(fp, "        },\n");
	    }
	    fprintf(fp, "      },\n      { ");

	    for (j = 0; j < 10; j++) {
		atom at = eTable[i]->attrList[j];

		if (at)
		    fprintf(fp, " %s,", GetAtomVal(at));
		else
		    fprintf(fp, " 0,");
	    }
	    fprintf(fp, " },\n      { ");
	    for (j = 0; j < 10; j++) {
		atom at = eTable[i]->reqAttrs[j];

		if (at)
		    fprintf(fp, " %s,", GetAtomVal(at));
		else
		    fprintf(fp, " 0,");
	    }
	    fprintf(fp, " },\n      { ");
	    for (j = 0; j < 10; j++) {
		atom at = eTable[i]->fixedAttrs[j];

		if (at)
		    fprintf(fp, " %s,", GetAtomVal(at));
		else
		    fprintf(fp, " 0,");
	    }
	    fprintf(fp, " },\n      { ");
	    for (j = 0; j < 10; j++) {
		atom at = eTable[i]->impliedAttrs[j];

		if (at)
		    fprintf(fp, " %s,", GetAtomVal(at));
		else
		    fprintf(fp, " 0,");
	    }
	    fprintf(fp, " },\n    },\t\t\t\t\t/* End of element %s */\n\n",
		    GetAtomVal(i));
	}
    }
    fprintf(fp, "};\n");
}

/*
 * Add an element to the list.  If list is 0, create it.
 */
ListEle *
AddListEle(ListEle *list, atom element)
{
    ListEle *new = (ListEle *)malloc(sizeof(ListEle));
    ListEle *lp;

    new->element = element;
    new->next = 0;

    if (list == 0)
	return (new);
    else {
	for (lp = list; lp->next; lp = lp->next)
	    ;
	lp->next = new;
	return (list);
    }
}

List *
AddList(List *list, atom element)
{
    if (list == 0) {
	list = (List *)malloc(sizeof(List));
	list->first = 0;
    }
    list->first = AddListEle(list->first, element);
    return (list);
}

ListEle *
DeleteListEle(ListEle *list, atom element)
{
    if (list == 0) {
	return (0);
    }
    else if (list->element == element) {
	ListEle *next = list->next;

	free(list);
	return (DeleteListEle(next, element));
    }
    else {
	list->next = DeleteListEle(list->next, element);
	return (list);
    }
}

List *
DeleteList(List *list, atom element)
{
    if (list == 0 || list->first == 0) {
	return (0);
    }
    else {
	list->first = DeleteListEle(list->first, element);
	if (list->first == 0) {
	    free (list);
	    return (0);
	}
    }
    return (list);
}

atom
PopList(List *list)
{
    atom at;
    ListEle *next;

    if (list == 0 || list->first == 0) {
	return (0);
    }

    at = list->first->element;
    next = list->first->next;
    free(list->first);
    list->first = next;
    return (at);
}

List *
sumLists(List *list1, List *list2)
{
    atom at;
    List *new = 0;

    while ((at = PopList(list1)) != 0)
	new = AddList(new, at);
    while ((at = PopList(list2)) != 0)
	new = AddList(new, at);
    return (new);
}

List *
subLists(List *list1, List *list2)
{
    atom at;
    List *new = 0;

    while ((at = PopList(list2)) != 0)
	list1 = DeleteList(list1, at);
    return (list1);
}

PrintList(List *list)
{
    ListEle *lp = list->first;

    fprintf(stdout, " (");
    while (lp) {
	fprintf(stderr, " %s", GetAtomVal(lp->element));
	lp = lp->next;
    }
    fprintf(stdout, " )");
}

static void
newElement(atom name, int type1, int type2, List *list)
{
    DTDElement *ep = (DTDElement *)calloc(1, sizeof(DTDElement));
    int i = 0;

    ep->name = name;
    if (type1 == 1)
	ep->flags |= E_ELE_OPT;
    if (type2 == 1) {
	if (list)
	    ep->flags |= E_TERM_OPT;
	else
	    ep->flags |= E_TERM_NONE;
    }
    else {
	ep->flags |= E_TERM_MAND;
    }

    if (list) {
	ListEle *lp = list->first;

	while (lp) {
	    ep->children[i++] = lp->element;
	    lp = lp->next;
	}
    }
    eTable[name] = ep;
}

static DTDAttribute *
newAttribute(atom name, int type, unsigned int valid, atom dataType,
	     List *list, char *defString, atom defAtom)
{
    DTDAttribute *ap = (DTDAttribute *)calloc(1, sizeof(DTDAttribute));
    int i = 0;

    ap->name = name;
    ap->type = type;
    ap->valid = valid;
    if (valid & AF_DATATYPE)
	ap->dataType = dataType;
    if (valid & AF_DEFSTRING)
	ap->defString = defString;
    if (valid & AF_DEFATOM)
	ap->defAtom = defAtom;
    if (valid & AF_LIST) {
	ListEle *lp = list->first;
 
	while (lp) {
	    ap->list[i++] = lp->element;
	    lp = lp->next;
	}
    }
    return (ap);
}

static void
insertAttr(atom name, List *list)
{
    ListEle *lp = list->first;
    int i = 0;

    while (lp) {
	DTDAttribute *ap = (DTDAttribute *)(lp->element);

	eTable[name]->attrList[i] = ap->name;	/* Copy name */
	eTable[name]->attrs[i++] = *ap;		/* Copy contents */
	lp = lp->next;
    }
}

/* Fill in the parents table for every element */
static void
GenerateParents()
{
    int i, j, k;

    for (i = 1; GetAtomVal(i); i++) {
	if (eTable[i]) {
	    atom at = eTable[i]->name;

	    for (j = 0; j < 40; j++) {
		atom child = eTable[i]->children[j];

		if (child == 0)
		    break;

		if (child != GetAtom("PCDATA") && child != GetAtom("CDATA")) {
		    for (k = 0; eTable[child]->parents[k] && (k < 40);  k++)
			;
		    eTable[child]->parents[k] = at;
		}
	    }
	}
    }
}

/* Create the required attribute list in each element */
static void
OrganizeAttrs()
{
    int i, j;
    DTDAttribute *ap;

    for (i = 1; GetAtomVal(i); i++) {
	if (eTable[i]) {
	    int reqIndex = 0, impliedIndex = 0, fixedIndex = 0;

	    for (j = 0; eTable[i]->attrs[j].name; j++) {
		if (eTable[i]->attrs[j].type == A_REQUIRED)
		    eTable[i]->reqAttrs[reqIndex++] = eTable[i]->attrs[j].name;
		else if (eTable[i]->attrs[j].type == A_FIXED)
		    eTable[i]->fixedAttrs[fixedIndex++] =
						    eTable[i]->attrs[j].name;
		else if (eTable[i]->attrs[j].type == A_IMPLIED)
		    eTable[i]->impliedAttrs[impliedIndex++] =
						    eTable[i]->attrs[j].name;
	    }
	}
    }
}
